Isoperimetric inequalities, growth, and the spectrum of graphs
نویسندگان
چکیده
منابع مشابه
Isoperimetric inequalities for minimal graphs
Based on Markvorsen and Palmer work on mean time exit and isoperimetric inequalities we establish slightly better isoperimetric inequalities and mean time exit estimates for minimal graphs in N × R. We also prove isoperimetric inequalities for submanifolds of Hadamard spaces with tamed second fundamental form. Mathematics Subject Classification: (2000): Primary 53C42; Secondary 53A10
متن کاملPercolation on finite graphs and isoperimetric inequalities
Consider a uniform expanders family Gn with a uniform bound on the degrees. It is shown that for any p and c > 0, a random subgraph of Gn obtained by retaining each edge, randomly and independently, with probability p, will have at most one cluster of size at least c|Gn|, with probability going to one, uniformly in p and the size of the expander. The method from Ajtai, Komlós and Szemerédi [1] ...
متن کاملIsoperimetric Inequalities for Cartesian Products of Graphs
We give a characterization for isoperimetric invariants, including the Cheeger constant and the isoperimetric number of a graph. This leads to an isoperimetric inequality for the cartesian products of graphs.
متن کاملOn The Isoperimetric Spectrum of Graphs
In this paper we introduce the k’th isoperimetric constant of a directed graph as the minimum of the mean outgoing normalized flows from a given set of k disjoint subsets of the vertex set of the graph. In this direction we show that the second isoperimetric constant in the general setting coincides with (the mean version of) the classical Cheeger constant of the graph, while for the rest of th...
متن کاملIsoperimetric Inequalities and the Width Parameters of Graphs
We relate the isoperimetric inequalities with many width parameters of graphs: treewidth, pathwidth and the carving width. Using these relations, we deduce 1. A lower bound for the treewidth in terms of girth and average degree 2. The exact values of the pathwidth and carving width of the d– dimensional hypercube, Hd 3. That treewidth (Hd) = Θ (
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1988
ISSN: 0024-3795
DOI: 10.1016/0024-3795(88)90224-8